Efficient embedding of complex networks to hyperbolic space via their Laplacian
نویسندگان
چکیده
منابع مشابه
Efficient embedding of complex networks to hyperbolic space via their Laplacian
The different factors involved in the growth process of complex networks imprint valuable information in their observable topologies. How to exploit this information to accurately predict structural network changes is the subject of active research. A recent model of network growth sustains that the emergence of properties common to most complex systems is the result of certain trade-offs betwe...
متن کاملGroups Quasi-isometric to Complex Hyperbolic Space
We show that any finitely generated group quasi-isometric to complex hyperbolic space is a finite extension of a properly discontinuous, cocompact subgroup of the isometry group.
متن کاملExploring complex networks via topological embedding on surfaces.
We demonstrate that graphs embedded on surfaces are a powerful and practical tool to generate, to characterize, and to simulate networks with a broad range of properties. Any network can be embedded on a surface with sufficiently high genus and therefore the study of topologically embedded graphs is non-restrictive. We show that the local properties of the network are affected by the surface ge...
متن کاملHyperbolic Geometry of Complex Networks
We develop a geometric framework to study the structure and function of complex networks. We assume that hyperbolic geometry underlies these networks, and we show that with this assumption, heterogeneous degree distributions and strong clustering in complex networks emerge naturally as simple reflections of the negative curvature and metric property of the underlying hyperbolic geometry. Conver...
متن کاملFault Detection and Isolation of Multi-Agent Systems via Complex Laplacian
This paper studies the problem of fault detection and isolation (FDI) for multi-agent systems (MAS) via complex Laplacian subject to actuator faults. A planar formation of point agents in the plane using simple and linear interaction rules related to complex Laplacian is achieved. The communication network is a directed, and yet connected graph with a fixed topology. The loss of symmetry in the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Scientific Reports
سال: 2016
ISSN: 2045-2322
DOI: 10.1038/srep30108